Generalized Taylor formulae, computations in real closed valued fields and quantifier elimination
نویسندگان
چکیده
We use generalized Taylor formulae in order to give some simple constructions in the real closure of an ordered valued field. We deduce a new, simple quantifier elimination algorithm for real closed valued fields and some theorems about constructible subsets of real valuative affine space.
منابع مشابه
Quantifier Elimination on Real Closed Fields and Differential Equations
This paper surveys some recent applications of quantifier elimination on real closed fields in the context of differential equations. Although polynomial vector fields give rise to solutions involving the exponential and other transcendental functions in general, many questions can be settled within the real closed field without referring to the real exponential field. The technique of quantifi...
متن کاملImaginaries in Real Closed Valued Fields I
We investigate the embeddings of the value group and residue field of a real closed valued field A in Aeq via quantifier elimination in a three sorted language. We classify the one types of field elements in a real closed valued field. Finally, we investigate some of the linear structure in Aeq induced by the valuation ring V and introduce the geometric sorts. In a subsequent paper we show that...
متن کاملQuantifier elimination for the theory of algebraically closed valued fields with analytic structure
The theory of algebraically closed non-Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper and which has far reaching consequences in the geometry of definable sets. This method of proving quantifier ...
متن کاملDynamic computations inside the algebraic closure of a valued field
We explain how to compute in the algebraic closure of a valued field. These computations heavily rely on the Newton Polygon Algorithm. They are made in the same spirit as the dynamic algebraic closure of a field. They give a concrete content to the theorem saying that a valued field does have an algebraically closed valued extension. The algorithms created for that purpose can be used to perfor...
متن کامل0-D-valued fields
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theorem in a different language L2 which was introduced by F. Delon in her thesis. This language allows us to lift the quantifier elimination result to a one-sorted language by a process described in the Appendix. As a bypr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007